全文获取类型
收费全文 | 932篇 |
免费 | 75篇 |
国内免费 | 45篇 |
专业分类
化学 | 23篇 |
力学 | 86篇 |
综合类 | 14篇 |
数学 | 881篇 |
物理学 | 48篇 |
出版年
2023年 | 2篇 |
2022年 | 14篇 |
2021年 | 17篇 |
2020年 | 13篇 |
2019年 | 23篇 |
2018年 | 15篇 |
2017年 | 30篇 |
2016年 | 32篇 |
2015年 | 17篇 |
2014年 | 38篇 |
2013年 | 57篇 |
2012年 | 65篇 |
2011年 | 38篇 |
2010年 | 56篇 |
2009年 | 68篇 |
2008年 | 53篇 |
2007年 | 58篇 |
2006年 | 49篇 |
2005年 | 42篇 |
2004年 | 28篇 |
2003年 | 33篇 |
2002年 | 18篇 |
2001年 | 23篇 |
2000年 | 13篇 |
1999年 | 21篇 |
1998年 | 22篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 7篇 |
1994年 | 23篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 7篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有1052条查询结果,搜索用时 15 毫秒
81.
B. Grigelionis 《Acta Appl Math》2003,78(1-3):155-163
Using stochastic integration theory in topological vector spaces general formulas for the Hellinger processes are derived. Feynman–Kac type formulas are obtained for the related Hellinger integrals in terms of the Hellinger processes and the geometric mean measures. The expected logarithmic utility from data, characterized as the Shannon information, is also considered. 相似文献
82.
M. S. Finkelstein 《商业与工业应用随机模型》2003,19(2):133-146
A number of conventional measures of risk as real‐valued functions on the space of positive random variables are considered: the expected shortfall, the mean excess over the threshold, the stop‐loss and some others. Ordering of risks, based on these measures and the distances between corresponding distribution functions, are described. The perturbed measures, describing the effect of changing environment, are discussed. These measures are defined by the accelerated life and proportional hazards models widely used in reliability and survival analysis. The case of a random environment is of a prime interest in the paper. The main result states that if, for instance, the stochastic environment is ‘neutral in expectation’ with respect to the baseline one, the distance between the corresponding distribution functions can be still sufficiently large. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
83.
84.
神经网络技术最为成功的应用领域之一是用于求解优化问题,本文就近年来的求解优化问题的神经网络方法进行了综述 相似文献
85.
We consider optimization problems with equality, inequality, and abstract set constraints, and we explore various characteristics of the constraint set that imply the existence of Lagrange multipliers. We prove a generalized version of the Fritz–John theorem, and we introduce new and general conditions that extend and unify the major constraint qualifications. Among these conditions, two new properties, pseudonormality and quasinormality, emerge as central within the taxonomy of interesting constraint characteristics. In the case where there is no abstract set constraint, these properties provide the connecting link between the classical constraint qualifications and two distinct pathways to the existence of Lagrange multipliers: one involving the notion of quasiregularity and the Farkas lemma, and the other involving the use of exact penalty functions. The second pathway also applies in the general case where there is an abstract set constraint. 相似文献
86.
Graph Coloring with Adaptive Evolutionary Algorithms 总被引:4,自引:0,他引:4
This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity. 相似文献
87.
Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs.Analytical as well as computational properties of the expected recourse function of simple integer recourse problems are studied. This includes sharp bounds on this function and the study of the convex hull. Finally, a finite termination algorithm is obtained that solves two classes of stochastic simple integer recourse problems.Supported by the National Operations Research Network in the Netherlands (LNMB). 相似文献
88.
The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Both the preemptive and the nonpreemptive cases of the problem are considered. 相似文献
89.
Svend-Holger Friis Ulrich Rieder Jürgen Weishaupt 《Mathematical Methods of Operations Research》1993,37(2):187-205
A general single-server queueing network model is considered. It is well-known that an optimal policy is determined by the largest-index policy. There is an index for each given queue and one allocates the server to a queue with largest current index. Using discounted dynamic programming we give a new and short proof of this result and derive some characterizations and bounds of the indices. Moreover, it is shown that an approximate largest-index policy yields an approximately optimal policy. These results lead to efficient methods for computing the indices. In particular, we present a general largest-remaining-index method. 相似文献
90.
初始点任意的一个非线性优化的广义梯度投影法 总被引:8,自引:0,他引:8
广义投影算法的优点是避免转轴运算。它成功地给出了线性约束问题、初始点任意的只带非线性不等式约束问题,以及利用辅助规划来处理带等式与不等式约束问题的算法.后者完满地解决了投影算法对于非线性等式约束问题的处理,但要求满足不等式约束的初始点.本文据此利用广义投影与罚函数技巧给出了一个初始点任意的等式与不等式约束问题的算法,省去了求初始解的计算,并保持了上述方法的优点,证明了算法的全局收敛性 相似文献